#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=200;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL n,t;cin>>n>>t;
  for(LL i=1;i<=n;i++) cin>>a[i];
  LL sum=0;
  for(LL i=1;i<=n;i++){
     sum+=(86400-a[i]);
     if(sum>=t){
        cout<<i<<"\n";
        break;
     }
  }
return 0;
}
